Section: New Results

Octagonal Domains for Continuous Constraints (continuous)

Participants : Marie Pelleau, Charlotte Truchet, Fréderic Benhamou.

Domains in Continuous Constraint Programming (CP) are generally represented with intervals whose n-ary Cartesian product (box) approximates the solution space. We propose a new representation for continuous variable domains based on octagons [28] . We generalize local consistency and split to this octagon representation, and we propose an octagonal-based branch and prune algorithm [22] . Experimental results in IBEX on the COCONUT benchmarks suite show promising performance improvements on several classical benchmarks.

The corresponding paper Octagonal Domains for Continuous Constraints got the Best Student Paper Award at the 17th International Conference on Principles and Practice of Constraint Programming (CP 2011 ) [22] .